A Robust Markovian Segmentation Based on Highest Confidence First (HCF)

نویسندگان

  • Thomas Meier
  • King Ngi Ngan
  • Gregory A. Crebbin
چکیده

A new robust method to segment images based on Markov Random Fields (MRF) is presented. The algorithm does not require the number of classes or regions K as input, which is normally difficult to determine in advance. There is also no need for an initial estimate obtained by an algorithm such as K-means. Further, each region is connected during the whole segmentation process leading to more reliable estimates of the regions’ mean gray levels and to fewer wrong detected boundaries. In addition, a novel way to incorporate edge information into the segmentation process is proposed resulting in a better detection of small objects. Experimental results demonstrate the performance of our technique.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Parallel Estimation for Markov Random Fields

We present a new , deterministic, distributed MAPes­ timation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The al­ gorithm has been applied to segmentation problems in computer vision and its performance compared with stochastic algorithms. The experiments show that Local HCF finds better estimates than stochas­ tic algorithms with much less computation.

متن کامل

Robust Potato Color Image Segmentation using Adaptive Fuzzy Inference System

Potato image segmentation is an important part of image-based potato defect detection. This paper presents a robust potato color image segmentation through a combination of a fuzzy rule based system, an image thresholding based on Genetic Algorithm (GA) optimization and morphological operators. The proposed potato color image segmentation is robust against variation of background, distance and ...

متن کامل

A trial across nine two-dimensional resampling operations showed that a quadratic took 55–63% of the time of a cubic for similar visual quality, while a linear interpolation

We present a Bayesian framework that combines motion (optical flow) estimation and segmentation based on a representation of the motion field as the sum of a parametric field and a residual field. The parameters describing the parametric component are found by a least squares procedure given the best estimates of the motion and segmentation fields. The motion field is updated by estimating the ...

متن کامل

Robust Iris Recognition in Unconstrained Environments

A biometric system provides automatic identification of an individual based on a unique feature or characteristic possessed by him/her. Iris recognition (IR) is known to be the most reliable and accurate biometric identification system. The iris recognition system (IRS) consists of an automatic segmentation mechanism which is based on the Hough transform (HT). This paper presents a robust IRS i...

متن کامل

Detection and location of moving objects using deterministic relaxation algorithms

Two important problems in motion analysis are addressed in this paper: change detection and moving object location. For the first problem, the inter-frame difference is modelized by a mixture of Laplacian distributions, a Gibbs random field is used for describing the label field, and HCF (Highest Confidence First) algorithm is used for solving the resulting optimization problem. The solution of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997